Nested Lattice Codes for Gaussian Two-Way Relay Channels
نویسندگان
چکیده
In this paper, we consider a Gaussian two-way relay channel (GTRC), where two sources exchange messages with each other through a relay. We assume that there is no direct link between sources, and all nodes operate in full-duplex mode. By utilizing nested lattice codes for the uplink (i.e., MAC phase), and structured binning for the downlink (i.e., broadcast phase), we propose two achievable schemes. Scheme 1 is based on “compute and forward” scheme of [1] while scheme 2 utilizes two different lattices for source nodes based on a three-stage lattice partition chain. We show that scheme 2 can achieve capacity region at the high signal-to-noise ratio (SNR). Regardless all channel parameters, the achievable rate of scheme 2 is within 0.2654 bit from the cut-set outer bound for user 1. For user 2, the proposed scheme achieves within 0.167 bit from the outer bound if channel coefficient is larger than one, and achieves within 0.2658 bit from the outer bound if channel coefficient is smaller than one. Moreover, sum rate of the proposed scheme is within 0.334 bits from the sum capacity. These gaps for GTRC are the best gap-to-capacity results to date.
منابع مشابه
On the Achievable Rate-Regions for the Gaussian Two-way Diamond Channels
In this channel,we study rate region of a Gaussian two-way diamond channel which operates in half-duplex mode. In this channel, two transceiver (TR) nodes exchange their messages with the help of two relay nodes. We consider a special case of the Gaussian two-way diamond channels which is called Compute-and-Forward Multiple Access Channel (CF-MAC). In the CF-MAC, the TR nodes transmit their mes...
متن کاملCapacity of the Gaussian Two-way Relay Channel to within 1/2 Bit
In this paper, a Gaussian two-way relay channel, where two source nodes exchange messages with each other through a relay, is considered. We assume that all nodes operate in full-duplex mode and there is no direct channel between the source nodes. We propose an achievable scheme composed of nested lattice codes for the uplink and structured binning for the downlink. We show that the scheme achi...
متن کاملBounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel
In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...
متن کاملCFMA (Compute-Forward Multiple Access) and its Applications in Network Information Theory
While both fundamental limits and system implementations are well understood for the point-to-point communication system, much less is developed for general communication networks. This thesis contributes towards the design and analysis of advanced coding schemes for multi-user communication networks with structured codes. The first part of the thesis investigates the usefulness of lattice code...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1301.6291 شماره
صفحات -
تاریخ انتشار 2013